Colouring of successor of regular, again
نویسندگان
چکیده
We get a version of the colouring property Pr1 proving $$\Pr_1(\lambda,\lambda,\lambda,\partial)$$ always when $$\lambda= \partial^+,\partial $$ are regular cardinals and some stationary subset $$\lambda$$ consisting ordinals cofinality $$< \partial$$ do not reflect in any ordinal \lambda$$ .
منابع مشابه
Colouring Random Regular Graphs
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular graph asymptotically almost surely (a.a.s.) has chromatic number 4 and that the chromatic number of a random d-regular graph for other d between 5 and 10 inclusive is a.a.s. restricted to a range of two integer values...
متن کاملColouring Random 4-Regular Graphs
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular graph. The analysis includes use of the differential equation method, and exponential bounds on the tail of random variables associated with branching processes. A substantial part of the analysis applies to random d-r...
متن کاملEdge-colouring eight-regular planar graphs
It was conjectured by the third author in about 1973 that every d-regular planar graph (possibly with parallel edges) can be d-edge-coloured, provided that for every odd set X of vertices, there are at least d edges between X and its complement. For d = 3 this is the four-colour theorem, and the conjecture has been proved for all d ≤ 7, by various authors. Here we prove it for d = 8.
متن کاملEdge-colouring seven-regular planar graphs
A conjecture due to the fourth author states that every d-regular planar multigraph can be d-edgecoloured, provided that for every odd set X of vertices, there are at least d edges between X and its complement. For d = 3 this is the four-colour theorem, and the conjecture has been proved for all d ≤ 8, by various authors. In particular, two of us proved it when d = 7; and then three of us prove...
متن کاملEdge-colouring of regular graphs of large degree
We consider the following conjecture: Let G be a k-regular simple graph with an even number n of vertices. If k ≥ n/2 then G is k-edge-colourable. We show that this conjecture is true for graphs that are join of two graphs and we provide a polynomial time algorithm for finding a k-edge-colouring of these graphs. c © 2007 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematica Hungarica
سال: 2021
ISSN: ['0001-5954', '0236-5294', '1588-2632']
DOI: https://doi.org/10.1007/s10474-021-01181-3